On Polynomial-Time Relation Reducibility
نویسندگان
چکیده
We study the notion of polynomial-time relation reducibility among computable equivalence relations. We identify some benchmark equivalence relations and show that the reducibility hierarchy has a rich structure. Specifically, we embed the partial order of all polynomial-time computable sets into the polynomial-time relation reducibility hierarchy between two benchmark equivalence relations Eλ and id. In addition, we consider equivalence relations with finitely many non-trivial equivalence classes and those whose equivalence classes are all finite.
منابع مشابه
Computable Component-wise Reducibility | Egor Ianovski
We consider equivalence relations and preorders complete for various levels of the arithmetical hierarchy under computable, component-wise reducibility. We show that implication in first order logic is a complete preorder for Σ1, the ≤m relation on EXPTIME sets for Σ2 and the embeddability of computable subgroups of (Q,+) for Σ3. In all cases, the symmetric fragment of the preorder is complete ...
متن کاملOn ~-reducibility versus Polynomial Time Many-one Reducibility*
We prove that each element of a class of f,anctions (denoted by NPCtP), whose graphs can be accepted in nondeterministic polynomial time, can be evaluated in deterministic polynomial time if and only if '/-reducibility is equivalent to polynomial time many-one reducibility. We also modify the proof technique used to obtain part of this result to obtain the stronger result that if every ,/-reduc...
متن کاملEnumeration Reducibility with Polynomial Time Bounds
We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analysis of this reducibility and its relationship with non deterministic polynomial time conjunctive reducibility. We discuss the basic properties of the degree structure induced by ≤pe over the computable sets and we show how to construct meets and joins. We are thus able to prove that this degree structure is...
متن کاملOn truth-table reducibility to SAT and the difference hierarchy over NP
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as log space truth-table reducibility via Boolean formulas to SAT and the same as log space Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. Finally, we show that the infinite difference hierarc...
متن کاملOn Truth-Table Reducibility to SAT
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as logspace truth-table reducibility via Boolean formulas to SAT and the same as logspace Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. We give an oracle relative to which ∆p2 is not equal to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 58 شماره
صفحات -
تاریخ انتشار 2017